def test_univalue_path_2():
# 1
# / \
# 4 5
# / \ \
# 4 4 5
sut = BinaryTreeNode(1)
sut.left = BinaryTreeNode(4)
sut.right = BinaryTreeNode(5)
sut.left.left = BinaryTreeNode(4)
sut.left.right = BinaryTreeNode(4)
sut.right.right = BinaryTreeNode(5)
# act
actual = solution.longest_univalue_path(sut)
# assert
assert actual == 2
from src.data_structures.binary_tree import BinaryTreeNode
import pytest
# arrange
# 1
# 2 3
# 4 5
sut = BinaryTreeNode(1)
sut.left = BinaryTreeNode(2)
sut.left.left = BinaryTreeNode(4)
sut.right = BinaryTreeNode(3)
sut.right.right = BinaryTreeNode(5)
def test_traverse_in_order():
assert sut.traverse_in_order() == [4, 2, 1, 3, 5]
def test_traverse_pre_order():
assert sut.traverse_pre_order() == [1, 2, 4, 3, 5]
def test_traverse_post_order():
assert sut.traverse_post_order() == [4, 2, 5, 3, 1]
def test_traverse_level_order():
assert sut.traverse_level_order() == [1, 2, 3, 4, 5]
def _setup_traverse_func_test():