Commitce3384e

committed

Update README.md

1 parent762dcad commitce3384eCopy full SHA for ce3384e

File tree

-1

lines changed

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -19,10 +19,11 @@ The height of the root is the height of the tree. The depth of a node is the len`
`19`	`19`	`This is commonly needed in the manipulation of the various self-balancing trees,`
`20`	`20`	`AVL Trees in particular. The root node has depth zero, leaf nodes have height zero,`
`21`	`21`	`and a tree with only a single node (hence both a root and leaf) has depth and height zero.`
`22`		`-Conventionally, an empty tree (tree with no nodes, if such are allowed) has depth and height −1.`
	`22`	`+Conventionally, an empty tree (tree with no nodes, if such are allowed) has depth and height −1.[4]`
`23`	`23`
`24`	`24`
`25`	`25`	`REF:`
`26`	`26`	`[1]http://xlinux.nist.gov/dads//HTML/perfectBinaryTree.html`
`27`	`27`	`[2]http://courses.cs.vt.edu/~cs3114/Fall09/wmcquain/Notes/T03a.BinaryTreeTheorems.`
`28`	`28`	`[3]http://courses.csail.mit.edu/6.006/fall09/lecture_notes/lecture04.pdf`
	`29`	`+[4]http://www.cs.cmu.edu/~adamchik/15-121/lectures/Trees/trees.html`

Comments

(0)