Sean :: Dev

Tree 용어 : Root, Child, Parent, Siblings, Leaf=Terminal, Branch=Internal, Degree, Height, Level => 모든 노드의 Degree(차수)가 2이하 Binary Tree 구현 순차 자료구조 (ex. 배열) Node (of Node i)IndexConditionParentfloor( i/2 )i > 1Left Child2i2i ≤ nRight Child2i+1(2i+1) ≤ nRoot10 < n 연결 자료구조 (ex. 하단 코드) class TreeNode { Object data; TreeNode left; TreeNode right; }Traversal (순회) : Pre-order, In-order, Post-order D L R (..