[자료구조] Binary Tree Level Order Traversal
바이너리 트리 레벨선회 구현하기 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 /...
황트루치
바이너리 트리 레벨선회 구현하기 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 /...
바이너리 트리 후위선회 구현하기 Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [3,2,1]. Note: Recursive solution is trivial,...
바이너리 트리 중위순회 구현하기 Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could...
More
최근 댓글