def stringToTreeNode(input):
input = input.strip()
input = input[1:-1]
if not input:
return None
inputValues = [s.strip() for s in input.split(',')]
root = TreeNode(int(inputValues[0]))
nodeQueue = [root]
front = 0
index = 1
while index < len(inputValues):
node = nodeQueue[front]
front = front + 1
item = inputValues[index]
index = index + 1
if item != "null":
leftNumber = int(item)
node.left = TreeNode(leftNumber)
nodeQueue.append(node.left)
if index >= len(inputValues):
break
item = inputValues[index]
index = index + 1
if item != "null":
rightNumber = int(item)
node.right = TreeNode(rightNumber)
nodeQueue.append(node.right)
return root
def build(data):
if len(data) == 0:
return TreeNode(0)
nodeQueue = []
# 创建一根节点，并将根节点进栈
root = TreeNode(data[0])
nodeQueue.append(root)
# 记录当前行节点的数量
lineNum = 2
# 记录当前行中数字在数组中的位置
startIndex = 1
# 记录数组中剩余元素的数量
restLength = len(data) - 1
while restLength > 0:
for index in range(startIndex, startIndex + lineNum, 2):
if index == len(data):
return root
cur_node = nodeQueue.pop()
if data[index] is not None:
cur_node.left = TreeNode(data[index])
nodeQueue.append(cur_node.left)
if index + 1 == len(data):
return root
if data[index + 1] is not None:
cur_node.right = TreeNode(data[index + 1])
nodeQueue.append(cur_node.right)
startIndex += lineNum
restLength -= lineNum
# 此处用来更新下一层树对应节点的最大值
lineNum = len(nodeQueue) * 2
return root
def init(self):
"Create browser tkinter widgets, including the tree."
global file_open
root = self.master
flist = (pyshell.flist if not (self._htest or self._utest) else
pyshell.PyShellFileList(root))
file_open = flist.open
pyclbr._modules.clear()
# create top
self.top = top = ListedToplevel(root)
top.protocol("WM_DELETE_WINDOW", self.close)
top.bind("<Escape>", self.close)
if self._htest: # place dialog below parent if running htest
top.geometry("+%d+%d" %
(root.winfo_rootx(), root.winfo_rooty() + 200))
self.settitle()
top.focus_set()
# create scrolled canvas
theme = idleConf.CurrentTheme()
background = idleConf.GetHighlight(theme, 'normal')['background']
sc = ScrolledCanvas(top,
bg=background,
highlightthickness=0,
takefocus=1)
sc.frame.pack(expand=1, fill="both")
item = self.rootnode()
self.node = node = TreeNode(sc.canvas, None, item)
if not self._utest:
node.update()
node.expand()
def init(self, flist):
self.flist = flist
# reset pyclbr
pyclbr._modules.clear()
# create top
self.top = top = ListedToplevel(flist.root)
top.protocol("WM_DELETE_WINDOW", self.close)
top.bind("<Escape>", self.close)
if self._htest: # place dialog below parent if running htest
top.geometry(
"+%d+%d" %
(flist.root.winfo_rootx(), flist.root.winfo_rooty() + 200))
self.settitle()
top.focus_set()
# create scrolled canvas
theme = idleConf.CurrentTheme()
background = idleConf.GetHighlight(theme, 'normal')['background']
sc = ScrolledCanvas(top,
bg=background,
highlightthickness=0,
takefocus=1)
sc.frame.pack(expand=1, fill="both")
item = self.rootnode()
self.node = node = TreeNode(sc.canvas, None, item)
node.update()
node.expand()
def StackBrowser(root, flist=None, tb=None, top=None):
if top is None:
top = tk.Toplevel(root)
sc = ScrolledCanvas(top, bg="white", highlightthickness=0)
sc.frame.pack(expand=1, fill="both")
item = StackTreeItem(flist, tb)
node = TreeNode(sc.canvas, None, item)
node.expand()
def reConstructBinaryTree(self, pre, tin):
if not pre or not tin:
return None
root = TreeNode(pre.pop(0))
index = tin.index(root.val)
root.left = self.reConstructBinaryTree(pre, tin[:index])
root.right = self.reConstructBinaryTree(pre, tin[index + 1:])
return root
def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
if not preorder:
return None
root = TreeNode(preorder[0])
i = inorder.index(root.val)
root.left = self.buildTree(preorder[1:i+1], inorder[:i])
root.right = self.buildTree(preorder[i+1:], inorder[i+1:])
return root
def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
if inorder:
index = inorder.index(preorder.pop(0))
node = TreeNode(inorder[index])
node.left = self.buildTree(preorder, inorder[0:index])
node.right = self.buildTree(preorder, inorder[index + 1:])
return node
def buildTree(self, data, pos):
pos += 1
if pos >= len(data) or data[pos] == None:
return None, pos
root = TreeNode(data[pos])
root.left, pos = self.buildTree(data, pos)
root.right, pos = self.buildTree(data, pos)
return root, pos
def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:
if not inorder:
return None
root = TreeNode(postorder[-1])
i = inorder.index(root.val)
root.left = self.buildTree(inorder[:i], postorder[:i])
root.right = self.buildTree(inorder[i+1:], postorder[i:-1])
return root
def sortedArrayToBST(self, num):
if not num:
return None
mid = len(num) // 2
root = TreeNode(num[mid])
root.left = self.sortedArrayToBST(num[:mid])
root.right = self.sortedArrayToBST(num[mid + 1:])
return root
def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
if not nums:
return None
mid = len(nums) // 2
root = TreeNode(nums[mid])
left = nums[:mid]
right = nums[mid + 1:]
if left:
root.left = self.sortedArrayToBST(left)
if right:
root.right = self.sortedArrayToBST(right)
return root
def _object_browser(parent): # htest #
import sys
from tkinter import Toplevel
top = Toplevel(parent)
top.title("Test debug object browser")
x, y = map(int, parent.geometry().split('+')[1:])
top.geometry("+%d+%d" % (x + 100, y + 175))
top.configure(bd=0, bg="yellow")
top.focus_set()
sc = ScrolledCanvas(top, bg="white", highlightthickness=0, takefocus=1)
sc.frame.pack(expand=1, fill="both")
item = make_objecttreeitem("sys", sys)
node = TreeNode(sc.canvas, None, item)
node.update()
def _object_browser(parent):
import sys
from tkinter import Toplevel
top = Toplevel(parent)
top.title('Test debug object browser')
x, y = map(int, parent.geometry().split('+')[1:])
top.geometry('+%d+%d' % (x + 100, y + 175))
top.configure(bd=0, bg='yellow')
top.focus_set()
sc = ScrolledCanvas(top, bg='white', highlightthickness=0, takefocus=1)
sc.frame.pack(expand=1, fill='both')
item = make_objecttreeitem('sys', sys)
node = TreeNode(sc.canvas, None, item)
node.update()
def _object_browser(parent):
import sys
from tkinter import Tk
root = Tk()
root.title("Test debug object browser")
width, height, x, y = list(map(int, re.split('[x+]', parent.geometry())))
root.geometry("+%d+%d"%(x, y + 150))
root.configure(bd=0, bg="yellow")
root.focus_set()
sc = ScrolledCanvas(root, bg="white", highlightthickness=0, takefocus=1)
sc.frame.pack(expand=1, fill="both")
item = make_objecttreeitem("sys", sys)
node = TreeNode(sc.canvas, None, item)
node.update()
root.mainloop()
def remote_stack_viewer(self):
from idlelib import debugobj_r
oid = self.rpcclt.remotequeue('exec', 'stackviewer', ('flist', ), {})
if oid is None:
self.tkconsole.root.bell()
return
item = debugobj_r.StubObjectTreeItem(self.rpcclt, oid)
from idlelib.tree import ScrolledCanvas, TreeNode
top = Toplevel(self.tkconsole.root)
theme = idleConf.CurrentTheme()
background = idleConf.GetHighlight(theme, 'normal')['background']
sc = ScrolledCanvas(top, bg=background, highlightthickness=0)
sc.frame.pack(expand=1, fill='both')
node = TreeNode(sc.canvas, None, item)
node.expand()
def helper(in_left, in_right):
# if there is no elements to construct subtrees
if in_left > in_right:
return None
# pick up the last element as a root
val = postorder.pop()
root = TreeNode(val)
# root splits inorder list
# into left and right subtrees
index = idx_map[val]
# build right subtree
root.right = helper(index + 1, in_right)
# build left subtree
root.left = helper(in_left, index - 1)
return root
def createtreemap(self,
tmrootnode=None,
sizepropname=SIZE_PROP,
clrpropname=CLR_PROP):
del self.filetree
if (tmrootnode != None):
self.tmrootnode = tmrootnode
ftreeroot = FileTreeItem(self.tmrootnode, self.tmcanvas)
self.filetree = TreeNode(self.treecanvas, None, ftreeroot)
self.filetree.update()
self.filetree.expand()
clrmap = self.getPropClrMap(self.tmrootnode, clrpropname)
self.tmcanvas.set(tmcolormap=clrmap,
sizeprop=sizepropname,
clrprop=clrpropname,
upper=[1200, 700],
tooltip=self.tooltip)
self.tmcanvas.drawTreemap(self.tmrootnode)
def helper(in_left=0, in_right=len(inorder)):
nonlocal pre_idx
# if there is no elements to construct subtrees
if in_left == in_right:
return None
# pick up pre_idx element as a root
root_val = preorder[pre_idx]
root = TreeNode(root_val)
# root splits inorder list
# into left and right subtrees
index = idx_map[root_val]
# recursion
pre_idx += 1
# build left subtree
root.left = helper(in_left, index)
# build right subtree
root.right = helper(index + 1, in_right)
return root
def init(self, flist):
self.flist = flist
pyclbr._modules.clear()
self.top = top = ListedToplevel(flist.root)
top.protocol('WM_DELETE_WINDOW', self.close)
top.bind('<Escape>', self.close)
if self._htest:
top.geometry(
'+%d+%d' %
(flist.root.winfo_rootx(), flist.root.winfo_rooty() + 200))
self.settitle()
top.focus_set()
theme = idleConf.CurrentTheme()
background = idleConf.GetHighlight(theme, 'normal')['background']
sc = ScrolledCanvas(top,
bg=background,
highlightthickness=0,
takefocus=1)
sc.frame.pack(expand=1, fill='both')
item = self.rootnode()
self.node = node = TreeNode(sc.canvas, None, item)
node.update()
node.expand()
while queue:
tmp, new_queue = [], collections.deque()
while queue:
node = queue.popleft() if to_right else queue.pop()
tmp.append(node.val)
if to_right:
if node.left:
new_queue.append(node.left)
if node.right:
new_queue.append(node.right)
else:
if node.right:
new_queue.appendleft(node.right)
if node.left:
new_queue.appendleft(node.left)
to_right = not to_right
queue = new_queue
res.append(tmp)
return res
root = TreeNode(1)
left = TreeNode(2)
left.left = TreeNode(4)
right = TreeNode(3)
right.right = TreeNode(5)
root.left = left
root.right = right
print(Solution().levelOrder(root))
def Parent__Dir(self):
Parent__Directory = self.home
to__ParentDir = FileTreeItem(self.home)
home__node = TreeNode(self.SC.canvas, to__ParentDir)
home__node.expand()
def Find__Directpry(self):
find__Dir = input('Enter Directory Path :: \n')
locate__Dir = FileTreeItem(find__Dir)
dirLocate__node = TreeNode(self.SC.canvas, None, locate__Dir)
dirLocate__node.expand()
# self.get_max_depth(root)
# return self.result
def get_max_depth(self, root):
if root is None:
return 0
left = self.get_max_depth(root.left)
right = self.get_max_depth(root.right)
self.result = max(self.result, right + left)
return max(left + 1, right + 1)
# Main Call
# Initialize the Tree First
tree_root = TreeNode(1)
tree_left_1 = TreeNode(2)
tree_right_1 = TreeNode(3)
tree_left_2 = TreeNode(4)
tree_left_3 = TreeNode(5)
tree_root.left = tree_left_1
tree_left_1.left = tree_left_2
tree_left_1.right = tree_left_3
tree_root.right = tree_right_1
tree_right_1.left = None
tree_right_1.right = None
tree_left_2.left = None
tree_left_2.right = None
tree_left_3.left = None
tree_left_3.right = None
# from treenode import TreeNode from idlelib.tree import TreeNode a: TreeNode = TreeNode(1)
