CS109A Notes for LectureBinary Trees Every binary tree has two \slots" for children; it may have none, either one, or both. Empty (0-node) binary tree is possible. - Binary search tree - Document - PDFSEARCH.IO

First Page	Meta Content
	CS109A Notes for LectureBinary Trees Every binary tree has two \slots" for children; it may have none, either one, or both. Empty (0-node) binary tree is possible. Add to Reading List Document Date: 2008-09-19 00:58:10 Open Document File Size: 48,70 KB Share Result on Facebook IndustryTerm comparison operator / / Person T . Fixup / / SocialTag Data management Binary search tree B-tree T-tree Tree R-tree Tree traversal Splay tree Binary trees Graph theory

CS109A Notes for LectureBinary Trees Every binary tree has two \slots" for children; it may have none, either one, or both.  Empty (0-node) binary tree is possible.Add to Reading List